Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/SK90SLASH2.52.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₃(s₁(0), y, z) -> F₃(0, s₁(y), s₁(z))
F₃(s₁(x), 0, s₁(z)) -> F₃(x, s₁(0), z)
F₃(s₁(x), s₁(y), 0) -> F₃(x, y, s₁(0))
F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)
F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))
F₃(0, s₁(0), s₁(s₁(z))) -> F₃(0, s₁(0), z)
F₃(0, s₁(s₁(y)), s₁(0)) -> F₃(0, y, s₁(0))
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(x, y, f₃(s₁(x), s₁(y), z))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₃(s₁(0), y, z) -> F₃(0, s₁(y), s₁(z))
F₃(s₁(x), 0, s₁(z)) -> F₃(x, s₁(0), z)
F₃(s₁(x), s₁(y), 0) -> F₃(x, y, s₁(0))
F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)
F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))
F₃(0, s₁(0), s₁(s₁(z))) -> F₃(0, s₁(0), z)
F₃(0, s₁(s₁(y)), s₁(0)) -> F₃(0, y, s₁(0))
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(x, y, f₃(s₁(x), s₁(y), z))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(0, s₁(0), s₁(s₁(z))) -> F₃(0, s₁(0), z)

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(0, s₁(0), s₁(s₁(z))) -> F₃(0, s₁(0), z)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = F₁(x3)
0 = 0
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(0, s₁(s₁(y)), s₁(0)) -> F₃(0, y, s₁(0))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(0, s₁(s₁(y)), s₁(0)) -> F₃(0, y, s₁(0))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = F₂(x1, x2)
0 = 0
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > F₂

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))
F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

The remaining pairs can at least by weakly be oriented.

F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))

Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = x2
0 = 0
s₁(x1) = s₁(x1)
f₃(x1, x2, x3) = f₃(x1, x2, x3)

Lexicographic Path Order [19].
Precedence:

f₃ > 0 > s₁

The following usable rules [14] were oriented:

f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))
f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(0, s₁(s₁(y)), s₁(s₁(z))) -> F₃(0, s₁(s₁(y)), s₁(z))

F₁ > s₁
0 > s₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₃(s₁(x), s₁(y), 0) -> F₃(x, y, s₁(0))
F₃(s₁(x), 0, s₁(z)) -> F₃(x, s₁(0), z)
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(x, y, f₃(s₁(x), s₁(y), z))

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(s₁(x), s₁(y), 0) -> F₃(x, y, s₁(0))
F₃(s₁(x), 0, s₁(z)) -> F₃(x, s₁(0), z)
F₃(s₁(x), s₁(y), s₁(z)) -> F₃(x, y, f₃(s₁(x), s₁(y), z))

The remaining pairs can at least by weakly be oriented.

F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)

Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = x1
s₁(x1) = s₁(x1)
0 = 0
f₃(x1, x2, x3) = f₃(x1, x2, x3)

Lexicographic Path Order [19].
Precedence:

f₃ > 0 > s₁

The following usable rules [14] were oriented:

f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, 0, z) -> s₁(z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, y, 0) -> s₁(y)
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(x, 0, 0) -> s₁(x)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)

The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(s₁(x), s₁(y), s₁(z)) -> F₃(s₁(x), s₁(y), z)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = F₁(x3)
s₁(x1) = s₁(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > F₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f₃(x, 0, 0) -> s₁(x)
f₃(0, y, 0) -> s₁(y)
f₃(0, 0, z) -> s₁(z)
f₃(s₁(0), y, z) -> f₃(0, s₁(y), s₁(z))
f₃(s₁(x), s₁(y), 0) -> f₃(x, y, s₁(0))
f₃(s₁(x), 0, s₁(z)) -> f₃(x, s₁(0), z)
f₃(0, s₁(0), s₁(0)) -> s₁(s₁(0))
f₃(s₁(x), s₁(y), s₁(z)) -> f₃(x, y, f₃(s₁(x), s₁(y), z))
f₃(0, s₁(s₁(y)), s₁(0)) -> f₃(0, y, s₁(0))
f₃(0, s₁(0), s₁(s₁(z))) -> f₃(0, s₁(0), z)
f₃(0, s₁(s₁(y)), s₁(s₁(z))) -> f₃(0, y, f₃(0, s₁(s₁(y)), s₁(z)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.